Known Plaintext Attack

A Known Plaintext Attack on Two-Key Triple Encryption

A chosen-plaintext attack on two-key triple encryption noted by Merkle and Hellman is extended to a known-plaintext attack. The known-plaintext attack has lower memory requirements than the chosen-plaintext attack, but has a greater running time. The new attack is a significant improvement over a known-plaintext brute-force attack, but is still not seen as a serious threat to two-key triple enc...

An Efficient Known Plaintext Attack on FEA-M

Yi et al. have proposed a cipher called the fast encryption algorithm for multimedia (FEA-M). Recently Mihaljević and Kohno pointed out that FEA-M is insecure. However, their attacks are not efficient: their chosen plaintext attack and known plaintext attack require 2-bit chosen plaintext and 2-bit known plaintext, respectively. In this paper we give an efficient known plaintext attack against ...

Improved Correlation Attack on RC5

Various attacks against RC5 have been analyzed intensively([1], [2], [4]–[7]). A known plaintext attack([2]) has not been reported that it works on so higher round as a chosen plaintext attack([1]), but it can work more efficiently and practically. In this paper we investigate a known plaintext attack against RC5 by improving a correlation attack ([7]). As for a known plaintext attack against R...

Known Plaintext Correlation Attack against RC5

Security of the private quantum channel

We extensively discuss the problem of encryption of quantum information. We present an attack on the private quantum channel which applies when partial classical description of the cipher text is known (the known-ciphertext attack) and show how to avoid this situation. The quantum analogue of the known-plaintext attack is also discussed.